Information cataloging

ABSTRACT

An information cataloging system disclosed herein provides a system and method for inferring relationships between various elements, such as e-mail address, phone number, etc., of various observations, such as business cards, observations obtained from the Internet, etc. The method comprises representing various elements, such as name, e-mail address, etc., using nodes, representing the relations between the various elements using edges connecting these nodes, computing a distance between two disparate nodes, wherein each of the two disparate nodes represent an element related to the entity. An implementation of the information cataloging system disclosed herein also provides a method of calculating noise and signal to noise ratio attached to various nodes and using such noise information in calculating confidence level of relationships between various elements.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims benefit of priority to U.S. Provisional Patent Application No. 61/500,454 entitled “INFORMATION CATALOGING” and filed on Jun. 23, 2011, which is incorporated by reference herein in its entirety.

FIELD

Implementations disclosed herein relate, in general, to the information management technology and specifically to technology for cataloging a large amount of information.

BACKGROUND

The use the computers and networking technologies such as the Internet and the World Wide Web have resulted in an explosion of information. Increasingly a large portion of such information is stored on interconnected servers. Enterprises and individuals store and retrieve information from remote locations, such as computers, mobile devices, etc., from remote data and computing servers. For example, a customer relationship management (CRM) system may search information about a customer from a first cloud server storing contact database, a second cloud server storing product database, a third server storing accounting and billing database, etc.

Existing means of doing information search methods that generally involve smaller datasets with long indexing operations. Such existing search methods are incompatible with the large amount of data needed to capture information from the large amount of data available on the Internet, the cloud servers, etc. For example, over several billion e-mail addresses may be available to an Internet search engine doing a search for a particular e-mail address, and building relationships among such e-mail addresses and between the e-mail addresses and other entity information, such as phone numbers, names, addresses, etc., requires prohibitive amount of indexing when current datasets and indexing operations are used.

The information included in this Background section of the specification, including any references cited herein and any description or discussion thereof, is included for technical reference purposes only and is not to be regarded subject matter by which the scope of the invention is to be bound.

SUMMARY

A method or system disclosed herein provides a method for inferring relationships between various elements, such as e-mail address, phone number, etc., of various observations, such as business cards, observations obtained from the Internet, etc. The method comprises representing various elements, such as name, e-mail address, etc., using nodes, representing the relations between the various elements using edges connecting these nodes, computing a distance between two disparate nodes, wherein each of the two disparate nodes represent an element related to the entity. An implementation of the information cataloging system disclosed herein also provides a method of calculating noise and signal to noise ratio attached to various nodes and using such noise information in calculating confidence level of relationships between various elements.

An alternative implementation of the method disclosed herein further comprises computing a first distance between one of the two disparate nodes to a third node, computing a second distance between the other of the two disparate nodes to the third node, and computing the distance between the two disparate nodes using a combination of the first distance and the second distance. Yet alternative implementation of the method disclosed herein further comprises computing the distance between the two disparate nodes further comprises computing the distance between the two disparate nodes as a ratio of the product of the first distance and the second distance to the sum of the first distance and the second distance.

In an alternative implementation, the method disclosed herein further comprises comparing at least two of the various nodes with each other and removing at least one of the two nodes if the similarity between the two nodes is above a similarity threshold. Yet alternatively, inferring the relationship further comprises inferring higher order relationship between the two disparate nodes. In an alternative implementation, the method disclosed herein further comprises comparing the computed distance to a threshold and inferring the relationship if the computed distance is higher than the threshold. In an alternative implementation, the method disclosed herein further comprises assigning a confidence level to one or more of the nodes, wherein the confidence level is determined based on a source of the observation containing the one or more of the nodes. Alternatively, computing the distance between the two disparate nodes further comprises computing the distance between the two disparate nodes using the confidence level assigned to each of the two disparate nodes. In an alternative implementation, the confidence level assigned to a particular node varies with age of the particular node. Yet alternatively, the confidence level assigned to a particular node varies based on the frequency of observation generating the particular node.

In an alternative implementation, the method disclosed herein further comprises assigning a noise level to one or more of the nodes and calculating a signal to noise ratio (SNR) of an edge based on noise levels of the nodes attached to that node. In an alternative implementation, the method disclosed herein further comprises comparing the SNR of an edge to a threshold and determining validity of a relationship if the SNR is above the threshold. For example, the threshold may be 0.7 or seventy percent. Alternatively, assigning a noise level to a node further comprises determining presence of multiple dissimilar nodes connected to the node. In an alternative implementation, the method disclosed herein further comprises propagating the noise attached to first node to a second node connected indirectly to the first node. Alternatively, in calculating the SNR of an edge, the signal levels of the nodes are added inversely and the noise levels of the nodes are added linearly. Yet alternatively, the elements of the observations (1) are related to one of the entity and (2) represent metadata about the entity.

This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Other features, details, utilities, and advantages of the claimed subject matter will be apparent from the following more particular written Detailed Description of various embodiments and implementations as further illustrated in the accompanying drawings and defined in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

A further understanding of the nature and advantages of the present technology may be realized by reference to the figures, which are described in the remaining portion of the specification. In the figures, like reference numerals are used throughout several figures to refer to similar components. In some instances, a reference numeral may have an associated sub-label consisting of a lower-case letter to denote one of multiple similar components. When reference is made to a reference numeral without specification of a sub-label, the reference is intended to refer to all such multiple similar components.

FIG. 1 illustrates an example block diagram representing functioning of an information cataloging system disclosed herein.

FIG. 2 illustrates an example block diagram representing the sources and flows of information in an information cataloging system disclosed herein.

FIG. 3 illustrates an example directed graph representing various elements as nodes and their relationships as edges.

FIG. 4 illustrates an alternative example of directed graph illustrating edge traversal through the directed graph.

FIG. 5 illustrates an example block diagram representing operations for noise suppression related to a node in the directed graph.

FIG. 6 illustrates an alternative example flow diagram representing operations of the information cataloging system disclosed herein.

FIG. 7 illustrates an example flowchart for cataloging of a new observation record.

FIG. 8 illustrates an example flowchart for discovering edges for existing observation records.

FIG. 9 illustrates an example of data sources and flows for querying information cataloging system.

FIG. 10 illustrates an example network environment for implementing the information cataloging system disclosed herein.

FIG. 11 illustrates an example computing system that can be used to implement the information cataloging system disclosed herein.

FIG. 12 illustrates an example mobile computing device that can be used to implement one or more components of the information cataloging system disclosed herein.

DETAILED DESCRIPTION

An information cataloging system disclosed herein allows cataloging of a large amount of information. For example, a database of user information may include a large number of e-mail addresses. Such database of e-mail addresses may be obtained using a number of different methods, including, obtaining the database from database vendors, obtaining the database from a social network operator, obtaining the database using Internet search engines, etc. Such data points are typically highly fragmented and would require a very large and generally prohibitive amount of indexing to establish any meaningful relationships among such data points. For example, to establish relationships between two data points that are not directly related to each other requires nested or recursive indexing, resulting in a requirement for a large amount of computing or processing resources. Generally, any attempt to associate the e-mails from the database to various entities, such as individuals, businesses, etc., requires a very large amount of indexing. Using traditional indexing methods to determine other information associated with such e-mail addresses, such as phone numbers, addresses, etc., requires a large number of data points. Furthermore, the higher the statistical confidence required of such associations, the higher is the number of data points that would need to be indexed.

The information cataloging system disclosed herein provides an efficient method of creating associations between a large number of observations. Specifically, the information cataloging system provides building such associations with a high level of confidence. For example, there are a large number of e-mail addresses in use and large information processing entities have access to a large number of such addresses, sometimes more than a billion. Moreover, each of these e-mail addresses has a number of other information attached to them. For example, an entity providing customer relationship management (CRM) system may have various databases having the e-mail addresses attached to client information. A social networking entity may be a have a large number of e-mail addresses in its database with each e-mail attached to a user, the user identifying information, the user's location, work, etc.

Furthermore, individual users have several e-mail addresses at any given time and such e-mail addresses vary over time. For example, when a particular user changes jobs, that user's work e-mail would most likely change. Furthermore, users also change their personal e-mail addresses over their life. Given the large number of e-mail addresses, the varying nature of the e-mail addresses, the varying nature of the e-mail addresses relation to other user identifying data, it becomes very difficult to identify relationships of the e-mail to other user identifying information. Similarly, phone numbers, Twitter™ addresses, etc., are other user identifiers with a very large data set, and each one of these user identifiers pose similar challenges in generating associations thereto. For example, it will take a prohibitive amount of time and computing resources to generate relationships between the given user identifying pieces of information, such as e-mails, names, etc., and identify other related information about such users.

The information cataloging system disclosed herein allows a user to take a user identifying piece of information, such as an e-mail address, phone number, etc., and generate other information attached to the user, such as the user's address, work, age, gender, etc., with a high degree of statistical confidence.

An implementation of the information cataloging system disclosed herein takes datasets form disparate entities, such as CRM dataset, billing dataset, e-mail dataset, etc., and generates identities using such datasets. For example, such an implementation takes contact information from various datasets and automatically creates an identity based on the individual records in each of the various datasets. For example, such disparate datasets may include a dataset about users from an e-mail database, such as Microsoft Outlook™, a billing dataset such as a dataset from Quicken™ Accounting, and a social networking dataset, such as a dataset from Google+™, and creates single identity for a user based on the records from each of such datasets. An example implementation of the information cataloging system disclosed herein collects a large amount of observation points, each observation point containing information about an individual or an entity, creates relationships among these observation points, and uses the observation points and the relationships to determine relationships among disparate observations with high degree of confidence.

FIG. 1 illustrates an example block diagram 100 representing functioning of an information cataloging system disclosed herein. The information cataloging system receives various observations 102-108 about an individual John Doe from a variety of sources. For example, an observation 102 received by the information cataloging system includes, a name, an e-mail address, and a phone number for John Doe from a CRM system. Because the observation 102 is received from a CRM system, the information cataloging system assigns a high level of confidence, 90% to observation 102. In one implementation, the confidence level assigned to the observation is also assigned to each of the elements of that particular observation. Thus, the e-mail address johndoe@example,edu, and the work phone number (720)xxx-yyyy will be assigned a confidence level of 90%.

Another observation point 104 may be John Doe's address from a telephone book that attaches John Doe's name with his e-mail address and his mailing address. On the other hand, the observation 106 may be received from an online account, such as a LinkedIn™ account, whereas the observation 108 may be received from an Internet search result that also provides the Twitter™ account for John Doe. In an alternative implementation, observations can also be obtained from queries provided by users to the information cataloging system. For example, if a user provides a query to find further information about a person with an e-mail address of johndoe@example.com in the city of Johnstown, the information cataloging system may create a new observation with relation between elements johndoe@example.com and Johnstown. In an alternative implementation, an observation may also include other metadata about an entity. For example, the observation 108 includes information about John Doe's visiting the Starbucks™ at a given frequency. Such metadata may also be used together with the other elements of the observation 108 in developing relationships between elements of the observation 108 and other elements from observations 102-106.

The information cataloging system saves each of these observation points 102-108 in one or more databases. Furthermore, each of the elements from the various observations are represented by nodes. Thus, the name John Doe is represented by a node, the e-mail address johndoe@example.com is represented by another node, etc. In one implementation, the information cataloging system compares an element received from an observation with existing elements stored in the system and if an exact match is found for the newly received element, the nodes representing such similar elements are collapsed into one node.

In an alternate implementation, a high level of similarity, even if it is not one hundred percent, can still be enough for the system to collapse nodes representing two highly similar nodes into one. For example, in the example implementation, the nodes created for the name John Doe from the observations 102 and 104 may be collapsed into one node. Similarly, the node for the name John See Doe, received from the observation 106 may also be collapsed with the node for the name John Doe from observations 102 and 104 due to the high level of similarity and/or the commonality of other related nodes (for example, each of the nodes representing John Doe and John See Doe, from observations 102 and 106, are connected to e-mail johndoe@example.edu. Similarly, even though the e-mail address for the observation 104, johndoe@mail.example.edu is different than the e-mail address for the observations 102 and 16, given the similarities of the base domain (example.edu), the high level of similarity between the e-mail addresses and the names show a very high likelihood of these observations being for the same entity.

Subsequently, the information cataloging system represents the relationships between various elements by edges in a directed graph. Thus, a relationship between the node representing the name John Doe is connected by an edge 114 to the e-mail johndoe@example.edu, another edge 116 represents an edge between the node for name John Doe and the node for John Doe's mailing address. Furthermore, the system also assigns distances to the edges. Such distances may be assigned based on the confidence level of the source, the frequency with which an observation is received, etc.

After representing the elements and the observed relationships using the nodes and the edges, the information cataloging system traversers the edges to create various computed edges (also referred to herein as the “higher order” edges). For example, FIG. 1 illustrates a computed edge 118 between the e-mail address of johndoe@example.edu and John doe's mailing address. In one implementation, the information cataloging system also assigns confidence to the edges based on the confidence assigned to the end nodes of the edges. Subsequently, the system generates inferences about the relations among the various elements of these observations.

The value assigned to edges between the nodes also changes over time. For example, an edge representing a relation between a name node and an e-mail node, where the relation is based on an observation that was obtained from a business card five years ago is less likely to show a valid relation between the name and e-mail address from that particular observation. Similarly, the value assigned to relations between data points of an observation increases if it is seen more often. Thus, for example, if a relation between Jane Doe's name and her e-mail address Janedoe@email.com is observed from more than one observation, the value assigned to this edge is increased with each new observation.

In one implementation, the system speculatively traverses the edges based on various measures such as a distance attributed to the edges, etc. FIG. 1 illustrates a directed graph 120 including some of the nodes and edges generated based on the elements of observations 102-108. A directed graph may be defined as a graph or set of nodes connected by edges where the edges have a direction associated with them. Such edges may be one-directional or bi-directional. In an alternative implementation, any two nodes of a directed graph may be connected to each other by two edges, each having a distinct direction. For example, a first node may be connected to a second node by a first edge directed from first node to the second node. Furthermore, the first node and the second node may also be independently connected by a second edge, which may have a direction different than the direction of the first edge. In the implementations disclosed herein, when a direction of the edges is not specified, such an edge may be considered to be bi-directional. In the directed graph 120, a node 130 represents the name John Doe, received from observation 102, the name John Doe from observation 104 is represented by a node 132 a, and the name John See Doe from observation 106 is represented by a node 132 b. Node 134 represents the e-mail address johndoe@example.edu and a node 136 represents a social networking account address @johndoe, each coming from the observation 108.

Given that the nodes 130 and 132 a represent name values with very high level of similarity (in this case, one hundred percent), the system may collapse them both into the same node 130. In an alternative implementation, if the similarity between two nodes are above a given similarity threshold value, the system may collapse such two nodes into a single node. Furthermore, given the high level of similarity between the values for nodes 130 and 132 b and given that each of 130 and 132 b are connected to a common e-mail address represented by node 134, the system may also collapse the node 132 b into node 130.

The edge 138 represents the relation between the name node 130 and the e-mail node 134 as per the observations 102 and 106. Given that the edge 138 was obtained based on two nodes the edge 138 may be assigned a higher confidence value. In one implementation, the higher the confidence value assigned to an edge, the lower is the distance assigned to that edge. Thus, it is assumed that if two nodes are closer, they are more likely to belong to the same entity. Thus, the distance between two points may be considered to be the inverse of the likelihood or probability of these two points belonging to the same entity. Thus, mathematically:

Distance between two points˜1/probability of the two points being the same

Now referring back to FIG. 1, the edge 140 represents the relation between the e-mail node 134 and the social networking account node 136, as obtained from the observation 108. In this case, because the observation 108 has a low confidence value attached thereto, the edge 140 will also have a lower confidence value (higher distance) assigned to it. The system uses the path 130-134-136 to generate a new computed edge (higher order edge) 142. The computation of the confidence (the distance) of the computed edge 142 is further discussed in detail below in FIG. 3.

The system uses the values assigned to various nodes and edges of the directed graph 120 to generate an output 150. In one implementation, the output 150 provides a listing of various elements related to John Doe. As illustrated herein, the output provides various elements from each of the observations 102-108 in a combined manner. Furthermore, the output 150 also provides confidence levels for each of the elements so that a user of the output 150 may determine whether to use a certain element or not. In One Alternative implementation, the information cataloging system disclosed herein may also automatically update one or more of the sources of the observations 102-108. For example, the output 150 may be used to update a CRM database that provided the observation 102, etc.

FIG. 2 illustrates an example block diagram representing the sources and flows of information in an information cataloging system 200 disclosed herein. Specifically, FIG. 2 discloses an information cataloging system 200 that receives data from a number of different sources, catalogs the data using one or more methods disclosed herein, receives query from one or more client systems, and generates query responses. The information cataloging system 200 includes a client system 202 that receives information and/or builds queries. For example, the client system 202 may receive information from a user from a business card 204 where a user is interested in finding more information about the individual identified by the business card.

The client system 202 generates queries using the information from the business card. In one implementation, the query may be as simple as a request to find all information that may be found about the individual identified by the business card. In an alternate implementation, the query may be more complex, such as a request for verifying one or more pieces of information from the business card, etc. In one implementation, the client system can be, for example, and e-mail or contact database server, such as the Microsoft Outlook™ server. For example, a built in application from such an e-mail server may automatically send a query to the information cataloging system any time it receives an email from an unrecognized e-mail address. Alternatively, the client system 202 may be a front end API layer, such as a web API layer that allows a combination of multiple services to use the information cataloging service provided by the information cataloging system 200. In yet another alternative implementation, the client system 202 may be a mobile device server that receives data from various mobile devices, such as smartphones, tablet devices, etc. Alternatively, the client system 202 may itself be embedded into a mobile device, such that it may readily collect various observations about an entity from the mobile device.

The information cataloging system 200 also includes a remote procedure call (RPC) module 206 that breaks down the query generated by the client system 202. The RPC module includes a number of inter-process communication procedures or subroutines that may be executed in address space of another server on behalf of the client system 202. In one implementation, the RPC module 206 has the option to determine if the query submitted by the client system 202 itself has the merit to be used as an observation that will be used by the information cataloging system 200 as observations. For example, if the client system 202 submits information from the business card 204, the RPC module 206 may determine to update the corpus of observations used by the information cataloging system 200 with the newly issued query. Such adding of the query to the corpus of the observations may be done in real-time or in a batch mode.

In one implementation, the RPC module 206 may also determine which server to submit the procedure call in response to a query. For example, the information cataloging system 200 may be implemented in a cloud or distributed server environment where depending on the content of the query the remote procedure call may be directed to a different server. The RPC module may be responsible for storing and maintaining the proper indexing to route such remote procedure calls to appropriate servers.

The information cataloging system also includes a graph traversal and query response module 208 (hereinafter referred to as “traversal and response module”) that performs the necessary graph traversals to keep the information cataloging system 200 up to date. In one implementation, the traversal and response module 208 processes the observations and its elements stored in the information cataloging system 200 to generate relational values between various nodes. For example, any time a new observation is received, the traversal and response module 208 may generate nodes and edges based on the elements of the observation, undertake graph traversal, calculations for the distances (confidence) of the edges of the graph, relate the nodes to existing nodes and edges, etc.

The traversal and response module 208 may also receive information from other network 212, such as for example, the Internet, etc. For example, the traversal and response module 212 may receive data feeds from the Internet resulting from pre-determined searches. In one implementation, in response to a query from the RPC module 206, the traversal and response module 208 may determine if it needs to perform a query in real-time. For example, if the traversal and response module 208 cannot generate a proper response to a query received from the RPC module 206, the traversal and response module 208 may determine to generate and send a real-time query to the network 212 using the query received from the RPC module 206.

In one implementation, the traversal and response module 208 may be configured to process the existing nodes and edges such that when a query is received from the RPC module 206, no new processing is necessary to generate the response to the query. In other words, the traversal and response module 208 may have already calculated all the edges related to each of the nodes and when a query matches a node, the results are generated based on the edges of such matching node and the distances thereof. The traversal and response module 208 is communicatively connected to databases 210 that stores the underlying observations, the nodes, the edges, etc. In one implementation, the database 210 may be implemented on a number of different servers or on a single database server. In one implementation, the database is implemented using a cloud based database sever. In an alternate implementation, the database 210 is implemented as a redundant distributed database.

The traversal and response module 208 generates the results in response to the query remote procedure call submitted by the RPC module 206 and returns the results to the client system 202. In one implementation, the client system 202 gets all the information that is generated in response to the query. In such an implementation, the client system 202 may decide what to do with the received information or how to further process the information. Thus, for example, in response to a query about an email address, the traversal and response module 208 sends information about all nodes that may be related to that email address node and the relative distance or confidence of each of the edges connecting the these nodes to the email node. In an alternative implementation, the traversal and response module 208 may use various threshold distance levels to determine what information is to be sent back to the client system 202. Yet alternatively, the traversal and response module 208 may merge all results of the query and send a combined response to the client system 202.

In an example illustration of the use of the information cataloging system 200, an email client 202 receives an email and sends a query to the RPC module 206. The RPC module 206 performs various remote procedure calls on the remote servers hosting the traversal and response module 208. The traversal and response module 208 performs the calls and determines values of all nodes, such as names, addresses, phone numbers, social networking accounts, etc., related to the email address. Subsequently, an updated profile or business card related to the email address is submitted to the email client 202. In one implementation, all of these steps are performed in real-time such that the email client 202 is able to return the business card received from the traversal and response module 208 with an email to an end user. In such an implementation, the traversal and response module 208 may also update the edge distances attached to the email address due to the additional inquiry regarding the email address.

FIG. 3 illustrates an example directed graph representing various elements as nodes and their relationships as edges. Specifically, FIG. 3 illustrates a directed graph generated based on elements received from three different observations 302, 304, and 306. Each of the observations 302, 304, 306 includes one or more elements. For example, the observation 302 includes an e-mail address E1, and phone numbers P1 and P2, the observation 304 includes a phone number P1 and street address S1, whereas the observation 306 includes a street address S1 and an email address E2. The information cataloging system disclosed herein assigns nodes to each of the elements.

Subsequently, the information cataloging system assigns edges between the various nodes and assigns distances (or confidence) to the edges. These edges that are generated based on the observed relations are referred to as the observed edges. In one implementation, the information cataloging system assigns distances based on the confidence level assigned to the observations. For example, if the observation 302 is obtained from a well maintained CRM system, the system assigns smaller distances (higher confidence) between the nodes representing E1, P1, and P2. On the other hand, if the observation 306 is obtained as a result of an Internet search, a larger distance (lower confidence) is assigned between the nodes S1 and E2. Furthermore, the system may also update the distance between the nodes based on the age of the observation. Thus, as an observation gets old, the confidence in the edges based on that observation decreases. In one implementation, to achieve such reduction in confidence, in a vector representing the distance or confidence of an edge, each component representing a data type of a node related to the edge, an additional component representing the age may be assigned an imaginary value such that the Euclidean norm of the vector is reduced as the age of the edge increases. Thus, as the age increases, it will have a negative impact on the resulting confidence level. Other components of such a vector may represent the dimensions related to the edges that may have been used in computing the distance of the given edge. For example, if a first higher order edge connecting an e-mail address is generated using a second edge connecting the e-mail to a phone number and a third edge connecting the e-mail address to a mailing address, the other components of the first higher order edge will also include a phone component, a mailing address component, etc.

After assigning the node to various elements and determining the edges and the distances of the edges, the system initiates an iterative traversal to generate relation between various nodes. For example, the system may start traversing at point P2 and start traversing all the nodes within a first distance (as may be illustrated by the circle 312). In doing so, the system may reduce the amount of nodes within a given circle. For example, if the system notices that there are two nodes with high similarity the system may collapse these two nodes into one and re-compute the distances related to the collapsed node. For example, in the illustrated example, each of the observations 302 and 304 have node P1 and P1 with the same phone number. As a result, the system would collapse these two nodes into one node, as represented on the resulting graph on the right side of FIG. 3.

The system iteratively increases the size of the circle, from 312 to 314 and re-computes the edges, collapses the nodes as possible, etc. As shown in FIG. 3, when the circle is increased to 314, the nodes representing S1 from observations 304 and 306 are collapsed as well. The resulting directed graph 320 provides the relationships between the elements received from the observations 302, 304, and 306. Furthermore, the system may also compute the distances of the edges between the other nodes based on the re-computed confidence values assigned to the remaining edges and the confidence values. For example, the system may compute the distance of an edge 316 between P2 and P1 based on the distance of the edge 318 between P2 and E1 and another edge 320 between E1 and P1.

In one example implementation, the value of the edge 316 is computed as the Euclidian distance between P2 and P1 based on the distances of 318 and 320. In an alternate implementation, the distance of the edge 316 may be calculated as if the distance of the edges 318 and 320 are resistances of an electrical circuit, connected in parallel. For example, if the distance of 318 were d1 and the distance of 320 were d2, the distance of 316 d may be calculated using the following equation:

d=1/(1/d1+1/d2)

Alternatively:

d=(d1*d2)/(d1+d2)

In yet alternative implementation, the system traverses through the different nodes in a speculative traversal mode. For example, the system may first traverse through the nodes of the observation 302 and subsequently, it selects one of the nodes, such as P1 to traverse to other nodes near P1 for a few iterations. In such an implementation, the system iterates from node P1 of observation 302 to node P2 of the observation 304 to node S1 of the observation 304 to node S1 of observation 306, etc. As the system iterates from P1 to P1 to S1, etc., the system collapses nodes as necessary and assigns new confidence values to the nodes and distances to the edges between the remaining nodes.

FIG. 4 illustrates an alternative example of directed graph 400 illustrating edge traversal through the directed graph. Specifically, FIG. 4 illustrates an observation 404 having nodes P1, E1 and S1. If the distance of the edge 408 between P1 and E1 were 3 and the distance of the edge 410 between E1 and S1 were 2, the distance d of the edge 412 between P1 and S1 may be calculated as:

d=1/(1/3+1/2)=6/5

However, if the system recognizes another observation 406 that gives the direct distance between P1 and S1 as 1, the system collapses the node P1 from observation 404 with node P1 from observation 406 and it collapses the node S1 from observation 404 with node S1 from the observation 406. In this case, the distance between P1 and S1 is recalculated as follows:

D=(1+6/5)=11/5

Thus, when the system finds two edges connecting given two nodes, it re-computes the distance between those two nodes as if those two edges were two resistors of an electrical circuit, connected in series.

FIG. 5 illustrates an example block diagram 500 representing operations for noise suppression related to a node in the directed graph. For example, if a node has multiple dissimilar associations to different nodes of the same type (noise), the value assigned to each of the edges connecting to such nodes is reduced. Thus, for example, if a phone number is assigned to five different names, it is likely that the phone number is not a personal phone number but is a phone number for a company's main line. In this case, the confidence value assigned to the edges between the phone number and each of the five nodes identifying the names is assigned a lower value and the noise value attached to these nodes is increased.

If the system observes such multiple dissimilar associations, the system adds a noise value to the node. For example, if the system discovers that node P, representing a phone number, is attached to five names N1-N5, representing names, it determines that at least one or more of the edges connecting the node P to the nodes N1-N5 represents noise. For example, the phone number P is likely the main office phone number for each of the users represented by nodes N1-N5. In such case, the system adds a noise value to the node P. In such example, the system first calculates the noise value to be added to node P based on the distances of each edges connecting the node P to the nodes N1-N5 and stores the noise value with node P.

The value of the noise attached to a node is opposite in effect to the value of confidence attached to that node. For example, if the confidence value attached to a node is considered to be a signal, the noise attached to the node allows the system to calculate a signal-to-noise (SNR) ratio attached to that node. Subsequently, the noise value as well as the SNR may be propagated to other nodes attached to the node. Thus, if the node P were attached to another node E, representing an email, the noise attached to the node P and the SNR of the node P may be propagated to the node E. When SNR is carried from node P to node E, it is carried in the opposite manner compared to the carrying of the value of the signal from the node P to node E. Thus, while the signal is added inversely, the noise is added linearly when the noise is transferred from a node P to a node E. Thus, the noise attached to a node has an effect of increasing the distance of the edge (thus decreasing the confidence).

Subsequently, the noise attached to a node can also be used in calculating the noise and the SNR of an edge connecting that particular node to another node. In one implementation, a threshold value of noise or SNR attached to each edge may be used to determine if that edge represents a valid relation between two nodes. For example, the system may determine that an SNR above threshold is acceptable to represent a valid relationship. Empirically, it is found that an SNR of 0.7 or above represents a valid relationship between two nodes. Thus, if the SNR of an edge between two nodes is below 0.7, that edge may not represent a valid relationship.

FIG. 6 illustrates an example flow diagram 600 representing operations of the information cataloging system that also uses the SNR related to nodes in determining if edges represent valid relationship. Specifically, a comparing operation 602 determines if a node is connected to multiple dissimilar nodes. For example, a node representing a company's main phone line may be connected to each employee's name. If the operation determines that the evaluated node is not connected to multiple dissimilar nodes, another node is selected for evaluation at an operation 603. Subsequently, a calculating operation 604 calculates the noise for the node based on the multiple dissimilar nodes and the distances to such nodes. An adding operation 606 adds the noise to the node. The noise is propagated to the other edges connected to the node by an operation 608. Another calculating operation 610 calculates the SNR for various nodes.

An operation 612 compares the SNR to a threshold to determine if an edge represents a valid relationship between two nodes. If the SNR is above a threshold, an operation 614 determines that edge to represent a valid relationship. If the SNR is not above a threshold, an operation 616 determines that edge does not represent a valid relationship.

In an alternate implementation, calculating the noise related to given node may comprise determining the degree of overlap between the given node's immediate neighboring nodes and the degree of equivalence among each neighboring nodes' neighbors. For example, if node A has a neighboring nodes B and C, the noise of node A will also depend on the commonality of neighbors for nodes B and C. Thus, if each of the nodes B and C had many neighboring nodes that are similar to each other, then the noise for node A will be lower. However, if there was little overlap in the neighboring nodes to nodes B and C, the noise assigned to node A will be higher.

Such calculation of noise based on the degree of overlap between the given node's immediate neighboring nodes and the degree of equivalence among each neighboring nodes' neighbors is further illustrated with respect to the directed graph 500 a of FIG. 5. Specifically, the noise at node N4 is connected to nodes N4-1 and N4-2, wherein if the nodes N4-1 and N4-1 are highly similar to each other, then the noise attributed to node N4 is lower. On the other hand, if the nodes N2-1 and N2-2 connected to the node N2 are highly dis-similar, the noise assigned to node N2 is higher. Furthermore, if two nodes N2 and N3 are connected to the same node N2-2, the noise attributed to each of the nodes N2 and N3 will be lower.

FIG. 7 illustrates an example flowchart 700 for cataloging of a new observation record. At operation 402, a new observation arrives at time 1306301770833 from source src-823723 containing:

a. primary work email: jane@janedoe.com

b. given name: Jane

c. family name: Doe

d. mobile phone: 303.123.4567

An operation 704 assigns trustworthiness to the entire observation. For example, we'll use 0.5. Subsequently, a splitting operation 706 splits the Observation into normalized ContactFields and save in a database using row keys:

a. email:work:primary:com.janedoe@jane:src-823723:1306301770833

b. name:given:Jane:src-823723:1306301770833

c. name:family:Doe:src-823723:1306301770833

d. phone:mobile:13031234567:src-823723:1306301770833

An operation 708 draws “same observation” edges to create an isolated sub graph. For example the outbound edges from the email vertex are shown below. Edge weight is computed by multiplying the observation's trustworthiness by a fixed set of “typed weightings”. This allows email→name to be stronger than name→email.

a. name:given:Jane:src-823723:1306301770833=0.5

b. name:family:Doe:src-823723:1306301770833=0.5

c. phone:mobile:13031234567:src-823723:1306301770833=0.3

-   -   i. i.e. this would be “email to mobile phone is always weighted         0.6” multiplied by the Observation's 0.5

For each ContactField, a queuing operation 710 queues a message to discover and record semantically equivalent vertices.

FIG. 8 illustrates an example flowchart 800 for discovering edges for existing observation records. A receiving operation 802 Receive a message to discover equivalent edges of:

email:work:primary:com.janedoe@jane:src-823723:1306301770833

An initiating operation 804 initiates a database scan starting at:

email:work:primary:com.janedoe@jane, pulling back columns from the “equivalent edge” column family.

For each discovered row where an edge does not exist, a saving operation 506 saves two new edges pointing in either direction, weighting them according to some globally-configurable “semantic equivalence” weight. This joins the sub-graph to the rest of the graph.

A queuing operation 808 queues a message to walk from:

email:work:primary:com.janedoe@jane:src-823723:1306301770833,

discovering and saving new nodes.

A discovering operation 810 receives a message to discover higher order edges

A. Should this be at the “observation” level

B. or the “contact field” level?

FIG. 9 illustrates an example of data sources and flows for querying information cataloging system. As illustrated in FIG. 9, an actor 902 queries the system by sending a vCard, XML, JSON, or other standardized format. This format is converted into an internal representation, which is then sent to a Query Processor 904. The Query Processor 904 queries a database 906 looking for contact fields, which are semantically equivalent to the fields present in the query. If equivalent contact fields are found, the query processor 904 finds each field's associated higher-order edges (In one implementation, higher order edges are stored by the database row key, which means that for a semantically-equivalent contact field, the system will have fast access to all pre-computed higher-order edges.).

These higher-order edges are returned to the Query Processor 904 along with a confidence factor for each edge. The edges are then sent to the Merger 908, which combines edges into semantically-unique destination fields non-linearly adding each edge's confidence factor. These merged edges are then returned to the Query Processor 904.

The contact fields are then sent to a filter 910 where data elements are filtered out. Data below certain confidence factors might be filtered out, or data that should not be returned to the actor for a variety of reasons, including data sensitivity or privacy concerns. The filtered data is returned to the Query Processor 904.

The model is returned to the Translator 902 and finally returned to the Actor 900 as a vCard, XML, JSON, or other standardized format.

FIG. 10 illustrates an example network environment 1000 for implementing the system for information cataloging as described herein. Specifically, FIG. 10 illustrates a communications network 1002 (e.g., the Internet) that is used by one or more computing or data storage devices for implementing the system for information cataloging. In one implementation, one or more user devices 1004 are communicatively connected to the communications network 1002. Examples of the user devices 1004 include a personal computer, a laptop, a smart-phone, tablet or slate (e.g., iPad), etc. A user interested in the information cataloging uses such user devices 1004 to access the system for information cataloging.

FIG. 11 illustrates an example computing system that can be used to implement one or more components of the information cataloging method and system described herein. A general-purpose computer system 1100 is capable of executing a computer program product to execute a computer process. Data and program files may be input to the computer system 1100, which reads the files and executes the programs therein. Some of the elements of a general-purpose computer system 1100 are shown in FIG. 11, wherein a processor 1102 is shown having an input/output (I/O) section 1104, a Central Processing Unit (CPU) 1106, and a memory section 1108. There may be one or more processors 1102, such that the processor 1102 of the computer system 1100 comprises a single central-processing unit 1106, or a plurality of processing units, commonly referred to as a parallel processing environment. The computer system 1100 may be a conventional computer, a distributed computer, or any other type of computer such as one or more external computers made available via a cloud computing architecture. The described technology is optionally implemented in software devices loaded in memory 1108, stored on a configured DVD/CD-ROM 1110 or storage unit 1112, and/or communicated via a wired or wireless network link 1114 on a carrier signal, thereby transforming the computer system 1100 in FIG. 11 to a special purpose machine for implementing the described operations.

The I/O section 1104 is connected to one or more user-interface devices (e.g., a keyboard 1116 and a display unit 1118), a disk storage unit 1112, and a disk drive unit 1120. Generally, in contemporary systems, the disk drive unit 1120 is a DVD/CD-ROM drive unit capable of reading the DVD/CD-ROM medium 1110, which typically contains programs and data 1122. Computer program products containing mechanisms to effectuate the systems and methods in accordance with the described technology may reside in the memory section 1104, on a disk storage unit 1112, or on the DVD/CD-ROM medium 1110 of such a system 1100, or external storage devices made available via a cloud computing architecture with such computer program products including one or more database management products, web server products, application server products and/or other additional software components. Alternatively, a disk drive unit 1120 may be replaced or supplemented by a floppy drive unit, a tape drive unit, or other storage medium drive unit. The network adapter 1124 is capable of connecting the computer system to a network via the network link 1114, through which the computer system can receive instructions and data embodied in a carrier wave. Examples of such systems include Intel and PowerPC systems offered by Apple Computer, Inc., personal computers offered by Dell Corporation and by other manufacturers of Intel-compatible personal computers, AMD-based computing systems and other systems running a Windows-based, UNIX-based, or other operating system. It should be understood that computing systems may also embody devices such as Personal Digital Assistants (PDAs), mobile phones, smart-phones, gaming consoles, set top boxes, tablets or slates (e.g., iPads), etc.

When used in a LAN-networking environment, the computer system 1100 is connected (by wired connection or wirelessly) to a local network through the network interface or adapter 1124, which is one type of communications device. When used in a WAN-networking environment, the computer system 1100 typically includes a modem, a network adapter, or any other type of communications device for establishing communications over the wide area network. In a networked environment, program modules depicted relative to the computer system 1100 or portions thereof, may be stored in a remote memory storage device. It is appreciated that the network connections shown are exemplary and other means of and communications devices for establishing a communications link between the computers may be used.

Further, the plurality of internal and external databases, data stores, source database, and/or data cache on the cloud server are stored as memory 1108 or other storage systems, such as disk storage unit 1112 or DVD/CD-ROM medium 1110 and/or other external storage device made available and accessed via a cloud computing architecture. Still further, some or all of the operations for the system for information cataloging disclosed herein may be performed by the processor 1102. In addition, one or more functionalities of the system disclosed herein may be generated by the processor 1102 and a user may interact with these GUIs using one or more user-interface devices (e.g., a keyboard 1116 and a display unit 1118) with some of the data in use directly coming from third party websites and other online sources and data stores via methods including but not limited to web services calls and interfaces without explicit user input.

A server 1206 hosts the system for information cataloging. In an alternate implementation, the server 1206 also hosts a website or an application that users visit to access the system for information cataloging. Server 1206 may be one single server, or a plurality of servers with each such server being a physical server or a virtual machine or a collection of both physical servers and virtual machines. Alternatively, a cloud 1208 hosts one or more components of the system for information cataloging. The user devices 1204, the server 1206, the cloud 1208, as well as other resources connected to the communications network 1202 access one or more of servers 1210, 1212, and 1214 for getting access to one or more websites, applications, web service interfaces, etc., that are used in information cataloging. In one implementation, the server 1206 also hosts a search engine that is used by the system for accessing the system for information cataloging and to select one or more services used in information cataloging.

FIG. 12 illustrates an example mobile computing device 1200 that can be used to implement one or more components of the information cataloging system disclosed herein. Specifically, the mobile computing device 1200. The mobile device 1200 includes a processor 1202, a memory 1204, a display 1206 (e.g., a touchscreen display), and other interfaces 1208 (e.g., a keyboard). The memory 1204 generally includes both volatile memory (e.g., RAM) and non-volatile memory (e.g., flash memory). An operating system 1210, such as the Microsoft Windows® Phone 7 operating system, resides in the memory 1204 and is executed by the processor 1202, although it should be understood that other operating systems may be employed.

One or more application programs 1212 are loaded in the memory 1204 and executed on the operating system 1210 by the processor 1202. Examples of applications 1212 include without limitation email programs, scheduling programs, personal information managers, Internet browsing programs, multimedia player applications, etc. In one implementation, an information cataloging application stored in the memory 1204 may be used to catalog various observations stored on the mobile device 1200, such as e-mail addresses from the e-mail application of the mobile device, the contacts from a contact management application stored on the mobile device 1200, etc. In yet alternate implementation, a client application stored in the memory 1204 of the mobile device 1200 may generate queries using the information stored on the mobile device 1200, receive entity relation information from a server generating relations between various elements, and display updated observations to a user of the mobile device 1200. A notification manager 1214 is also loaded in the memory 1204 and is executed by the processor 1202 to present notifications to the user. For example, when a promotion is triggered and presented to the shopper, the notification manager 1214 can cause the mobile device 1200 to beep or vibrate (via the vibration device 1218) and display the promotion on the display 1206.

The mobile device 1200 includes a power supply 1216, which is powered by one or more batteries or other power sources and which provides power to other components of the mobile device 1200. The power supply 1216 may also be connected to an external power source that overrides or recharges the built-in batteries or other power sources.

The mobile device 1200 includes one or more communication transceivers 1230 to provide network connectivity (e.g., mobile phone network, Wi-Fi®, BlueTooth®, etc.). The mobile device 1200 also includes various other components, such as a positioning system 1220 (e.g., a global positioning satellite transceiver), one or more accelerometers 1222, one or more cameras 1224, an audio interface 1226 (e.g., a microphone, an audio amplifier and speaker and/or audio jack), and additional storage 1228. Other configurations may also be employed.

Embodiments of the present technology are disclosed herein in the context of an information cataloging system. In the above description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some of these specific details. For example, while various features are ascribed to particular embodiments, it should be appreciated that the features described with respect to one embodiment may be incorporated with other embodiments as well. By the same token, however, no single feature or features of any described embodiment should be considered essential to the invention, as other embodiments of the invention may omit such features.

In the interest of clarity, not all of the routine functions of the implementations described herein are shown and described. It will, of course, be appreciated that in the development of any such actual implementation, numerous implementation-specific decisions must be made in order to achieve the developer's specific goals, such as compliance with application—and business-related constraints, and that those specific goals will vary from one implementation to another and from one developer to another.

According to one embodiment of the present invention, the components, process steps, and/or data structures disclosed herein may be implemented using various types of operating systems (OS), computing platforms, firmware, computer programs, computer languages, and/or general-purpose machines. The method can be run as a programmed process running on processing circuitry. The processing circuitry can take the form of numerous combinations of processors and operating systems, connections and networks, data stores, or a stand-alone device. The process can be implemented as instructions executed by such hardware, hardware alone, or any combination thereof. The software may be stored on a program storage device readable by a machine.

According to one embodiment of the present invention, the components, processes and/or data structures may be implemented using machine language, assembler, C or C++, Java and/or other high level language programs running on a data processing computer such as a personal computer, workstation computer, mainframe computer, or high performance server running an OS such as Solaris® available from Sun Microsystems, Inc. of Santa Clara, Calif., Windows Vista™, Windows NT®, Windows XP PRO, and Windows® 2000, available from Microsoft Corporation of Redmond, Wash., Apple OS X-based systems, available from Apple Inc. of Cupertino, Calif., or various versions of the Unix operating system such as Linux available from a number of vendors. The method may also be implemented on a multiple-processor system, or in a computing environment including various peripherals such as input devices, output devices, displays, pointing devices, memories, storage devices, media interfaces for transferring data to and from the processor(s), and the like. In addition, such a computer system or computing environment may be networked locally, or over the Internet or other networks. Different implementations may be used and may include other types of operating systems, computing platforms, computer programs, firmware, computer languages and/or general purpose machines; and. In addition, those of ordinary skill in the art will recognize that devices of a less general purpose nature, such as hardwired devices, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), or the like, may also be used without departing from the scope and spirit of the inventive concepts disclosed herein.

In the context of the present invention, the term “processor” describes a physical computer (either stand-alone or distributed) or a virtual machine (either stand-alone or distributed) that processes or transforms data. The processor may be implemented in hardware, software, firmware, or a combination thereof.

In the context of the present technology, the term “data store” describes a hardware and/or software means or apparatus, either local or distributed, for storing digital or analog information or data. The term “Data store” describes, by way of example, any such devices as random access memory (RAM), read-only memory (ROM), dynamic random access memory (DRAM), static dynamic random access memory(SDRAM), Flash memory, hard drives, disk drives, floppy drives, tape drives, CD drives, DVD drives, magnetic tape devices (audio, visual, analog, digital, or a combination thereof), optical storage devices, electrically erasable programmable read-only memory (EEPROM), solid state memory devices and Universal Serial Bus (USB) storage devices, and the like. The term “Data store” also describes, by way of example, databases, file systems, record systems, object oriented databases, relational databases, SQL databases, audit trails and logs, program memory, cache and buffers, and the like.

The above specification, examples and data provide a complete description of the structure and use of exemplary embodiments of the invention. Although various embodiments of the invention have been described above with a certain degree of particularity, or with reference to one or more individual embodiments, those skilled in the art could make numerous alterations to the disclosed embodiments without departing from the spirit or scope of this invention. In particular, it should be understand that the described technology may be employed independent of a personal computer. Other embodiments are therefore contemplated. It is intended that all matter contained in the above description and shown in the accompanying drawings shall be interpreted as illustrative only of particular embodiments and not limiting. Changes in detail or structure may be made without departing from the basic elements of the invention as defined in the following claims. 

1. A computer implemented method comprising: representing various elements from each of a plurality of observations about an entity using a node; representing relations between the various elements using edges connecting the nodes; computing a distance between two disparate nodes, each of the two disparate nodes representing an element related to the entity; and inferring a relationship between the two disparate nodes based on the computed distance between the two disparate nodes.
 2. The method of claim 1, wherein computing the distance between two disparate nodes further comprises: computing a first distance between one of the two disparate nodes to a third node; computing a second distance between the other of the two disparate nodes to the third node; and computing the distance between the two disparate nodes using a combination of the first distance and the second distance.
 3. The method of claim 2, computing the distance between the two disparate nodes further comprises computing the distance between the two disparate nodes as a ratio of the product of the first distance and the second distance to the sum of the first distance and the second distance.
 4. The method of claim 1, further comprising comparing at least two of the various nodes with each other and removing at least one of the two nodes if the similarity between the two nodes is above a similarity threshold.
 5. The method of claim 1, wherein inferring the relationship further comprises inferring higher order relationship between the two disparate nodes.
 6. The method of claim 1, wherein inferring the relationship further comprises comparing the computed distance to a threshold; and inferring the relationship if the computed distance is higher than the threshold.
 7. The method of claim 2, further comprising assigning a confidence level to one or more of the nodes, wherein the confidence level is determined based on a source of the observation containing the one or more of the nodes.
 8. The method of claim 7, wherein computing the distance between the two disparate nodes further comprises computing the distance between the two disparate nodes using the confidence level assigned to each of the two disparate nodes.
 9. The method of claim 7, wherein the confidence level assigned to a particular node varies with age of the particular node.
 10. The method of claim 7, wherein the confidence level assigned to a particular node varies based on the frequency of observation generating the particular node.
 11. The method of claim 1, further comprising: assigning a noise level to one or more of the nodes; and calculating a signal to noise ratio (SNR) of an edge based on noise levels of the nodes attached to that node.
 12. The method of claim 11, further comprising: comparing the SNR of an edge to a threshold; and determining validity of a relationship if the SNR is above the threshold.
 13. The method of claim 12, wherein the threshold is 0.7.
 14. The method of claim 11, wherein assigning a noise level to a node further comprises determining presence of multiple dissimilar nodes connected to the node.
 15. The method of claim 11, further comprising propagating the noise attached to first node to a second node connected indirectly to the first node.
 16. The method of claim 11, wherein in calculating the SNR of an edge, the signal levels of the nodes are added inversely and the noise levels of the nodes are added linearly.
 17. The method of claim 1, wherein the elements of the observations (1) are related to one of the entity and (2) represent metadata about the entity.
 18. A non-transitory computer-readable storage medium having computer-executable instructions comprising: representing various elements from each of a plurality of observations about an entity using a node; representing relations between the various elements using edges connecting the nodes; computing a distance between two disparate nodes, each of the two disparate nodes representing an element related to the entity; inferring a relationship between the two disparate nodes based on the computed distance between the two disparate nodes; assigning a noise level to each of the two disparate nodes; and calculating a signal to noise ratio (SNR) of an edge based on noise levels of the nodes attached to that edge.
 19. The non-transitory computer-readable storage medium of claim 18, wherein the computer-executable instructions further comprises: computing a first distance between one of the two disparate nodes to a third node; computing a second distance between the other of the two disparate nodes to the third node; and computing the distance between the two disparate nodes as a function of a ratio of the product of the first distance and the second distance to the sum of the first distance and the second distance.
 20. The non-transitory computer-readable storage medium of claim 18, wherein the computer-executable instructions further comprises comparing at least two of the various nodes with each other and collapsing at least one of the two nodes into the other of the two nodes if the similarity between the two nodes is above a similarity threshold.
 21. The non-transitory computer-readable storage medium of claim 18, wherein inferring a relationship between the two disparate nodes further comprises inferring a higher order relationship between the two disparate nodes based on relationship of each of the two disparate nodes to a third node.
 22. The non-transitory computer-readable storage medium of claim 18, wherein the computer-executable instructions further comprises computing the distance between the two disparate nodes further comprises computing the distance between the two disparate nodes using confidence levels assigned to each of the two disparate nodes.
 23. The non-transitory computer-readable storage medium of claim 22, wherein the confidence level assigned to a particular node varies with age of the particular node and based on the frequency of observation generating the particular node.
 24. The non-transitory computer-readable storage medium of claim 18, wherein the computer-executable instructions further comprises comparing determining validity of a relationship between two nodes if the SNR of the edge connecting the two nodes is above a threshold.
 25. The non-transitory computer-readable storage medium of claim 18, wherein the computer-executable instructions further comprises propagating the noise attached to first node to a second node connected to the first node.
 26. A system, comprising: a processor and a memory, wherein the memory comprising: a graph generation module configured to represent various elements from each of a plurality of observations about an entity using a node in the memory and to represent relations between the various elements using edges stored in the memory, the edges connecting the nodes; a graph traversal module configured to compute a distance between two disparate nodes, each of the two disparate nodes representing an element related to the entity; and an inference module configured to infer a relationship between the two disparate nodes based on the computed distance between the two disparate nodes.
 27. The system of claim 26, wherein the memory further comprises a noise compression module stored in the memory, the noise compression module configured to assign a noise value to a node and to calculate a signal to noise ratio (SNR) of an edge based on noise levels of the nodes attached to that edge.
 28. The system of claim 27, wherein the noise compression module is further configured to compare the SNR of an edge to a threshold to determine validity of a relationship represented by the edge.
 29. The system of claim 26, wherein the inference module is further configured to: compute a first distance between one of the two disparate nodes to a third node; compute a second distance between the other of the two disparate nodes to the third node; and compute the distance between the two disparate nodes using a combination of the first distance and the second distance as a ratio of the product of the first distance and the second distance to the sum of the first distance and the second distance. 